Robust Orbit Determination via Convex Optimization
نویسنده
چکیده
Given the initial position and velocity of an object, such as a satellite in orbit around the Earth, it is possible to determine its position and velocity at any other time by integrating the equations of motion. This prediction method is called propagating. Specifying the position and velocity of the satellite at a specific time, called the epoch, is a common way of representing an orbit. In this context, the position and velocity are known as the Cartesian orbital elements. Different methods of representing an orbit are in common use and it is rare to use one representation in isolation. Classical elements are another common representation that are easily interpreted and propagated. For this reason, classical elements were used in this project. While providing a thorough background in orbital mechanics is beyond the scope of this paper, an excellent reference is [PC12], which discusses orbital elements and propagation in detail. Given the orbit of a satellite, it is straightforward to compute its distance from a point on the Earth, such as a ground station, at any time. Ground stations can measure this distance, called the range, by sending a signal to the satellite. The satellite sends back a signal after a known delay, which is finally received by the ground station. By measuring the total transmission time and factoring in atmospheric effects, the range can be estimated with high accuracy. A ground station may also measure the elevation and azimuth of a satellite. The issues involved in accurate estimation of these parameters, collectively called tracking data, are discussed in [TSB04, §3]. For simplicity, in this project we focused on range measurements only. Accommodating other measurement types is straightforward. Let fr(x; t) be the range measured by a particular ground station at a particular time t, provided the orbital elements are given by x and the measurements have no noise. Informally, fr answers the question: at time t, how far is the satellite from the ground station? Evaluating fr is nontrivial. We must propagate the orbital elements to the desired time and account for signal delays to determine the range a ground station would measure at time t. High fidelity propagators will result in an fr for which analytical formulas are not possible, and in practice, even simple forms are too complex to differentiate explicitly. Instead, numerical methods are used to compute gradients approximately.
منابع مشابه
Robust nonlinear optimization via the dual
Robust nonlinear optimization is not as well developed as the linear case, and limited in the constraints and uncertainty sets it can handle. In this work we extend the scope of robust optimization by showing how to solve a large class of robust nonlinear optimization problems. The fascinating and appealing property of our approach is that any convex uncertainty set can be used. We give an expl...
متن کاملLinear Time Varying MPC Based Path Planning of an Autonomous Vehicle via Convex Optimization
In this paper a new method is introduced for path planning of an autonomous vehicle. In this method, the environment is considered cluttered and with some uncertainty sources. Thus, the state of detected object should be estimated using an optimal filter. To do so, the state distribution is assumed Gaussian. Thus the state vector is estimated by a Kalman filter at each time step. The estimation...
متن کاملGeometric and Combinatorial Aspects of Convex Optimization Aspects géométriques et combinatoires de l’optimisation convexe (Org:
A fundamental domain of geometric object X is a minimal subset D such that the object can be covered by isomorphs of D under the natural symmetry group of X. For a convex polyhedral cone we have the property that every orbit of extreme rays has exactly one representative in a given fundamental domain. In this talk I will present some ideas and preliminary experiments for computing orbits of ext...
متن کاملStrong Duality in Robust Convex Programming: Complete Characterizations
Abstract. Duality theory has played a key role in convex programming in the absence of data uncertainty. In this paper, we present a duality theory for convex programming problems in the face of data uncertainty via robust optimization. We characterize strong duality between the robust counterpart of an uncertain convex program and the optimistic counterpart of its uncertain Lagrangian dual. We...
متن کاملRobust Control of Constrained Systems via Convex Optimization
A successful controller design paradigm must take into account both model uncertainty and design specifications. In this paper we propme a design procedure, based upon the use of convex optim'bation, that takes explicitly into account both time and frequency domain specifications. The main result of the paper shows that these controllers can be obtained by solving a sequence of problems, each o...
متن کامل